TPTP Problem File: SEU833^5.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU833^5 : TPTP v8.2.0. Released v4.0.0.
% Domain : Set Theory
% Problem : TPS problem GAZING-THM24
% Version : Especial.
% English : Trybulec's 61st Boolean property of sets
% Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% : [Bar92] Barker-Plummer D (1992), Gazing: An Approach to the Pr
% : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% Source : [Bro09]
% Names : tps_0064 [Bro09]
% : 24 [Bar92]
% : GAZING-THM24 [TPS]
% : BOOL-PROP-61 [TPS]
% Status : Theorem
% Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.0
% Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% Number of atoms : 3 ( 1 equ; 0 cnn)
% Maximal formula atoms : 1 ( 3 avg)
% Number of connectives : 2 ( 0 ~; 0 |; 1 &; 1 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 3 ( 2 ^; 1 !; 0 ?; 3 :)
% SPC : TH0_THM_EQU_NAR
% Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% project in the Department of Mathematical Sciences at Carnegie
% Mellon University. Distributed under the Creative Commons copyleft
% license: http://creativecommons.org/licenses/by-sa/3.0/
% : Polymorphic definitions expanded.
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cGAZING_THM24_pme,conjecture,
! [S: a > $o] :
( ( ^ [Xx: a] :
( ( S @ Xx )
& $false ) )
= ( ^ [Xx: a] : $false ) ) ).
%------------------------------------------------------------------------------